Clausi cation in Coq
نویسندگان
چکیده
Clausi cation is an essential step in the so called resolution method one of the most successful procedures for automated theorem proving Anticipating the use of resolution in proof construction systems based on type theory we elaborate the clausi cation procedure in Coq and illustrate its usefulness The results presented in this paper also constitute the formal veri cation of the correctness of clausi cation The complete clausi cation program and the correctness proof can be found on the following Internet address http www phil uu nl bezem Coq clausification v
منابع مشابه
Formal Verification of a Memory Model for C-Like Imperative Languages
This paper presents a formal veri cation with the Coq proof assistant of a memory model for C -like imperative languages. This model de nes the memory layout and the operations that manage the memory. The model has been speci ed at two levels of abstraction and implemented as part of an ongoing certi cation in Coq of a moderatelyoptimising C compiler. Many properties of the memory have been ver...
متن کاملA Proof checked Veri cation of a Real Time Communication Protocol
We present an analysis of a protocol developed by Philips to connect several com ponents of an audio system The veri cation of the protocol is carried out using the timed I O automata model of Lynch and Vaandrager The veri cation has been partially proof checked with the interactive proof construction program Coq The proof checking revealed an error in the correctness proof not in the protocol
متن کاملThe static debugger: classical realizability rescuing the programmer
Software certi cation aims at proving the correctness of programs but in many cases, the use of external libraries allows only a conditional proof : the correctness of the program depends on the assumption that the libraries meet their speci cations. In particular, a bug in these libraries might still impact the certi ed program. In this case, the di culty that arises is to isolate the defectiv...
متن کاملA Formal Veri cation of the Alternating Bit Protocol in the Calculus of Constructions
We report on a formal veri cation of the Alternating Bit Protocol ABP in the Calculus of Constructions We outline a semi formal correctness proof of the ABP with su cient detail to be formalised Thereafter we show by examples how the formalised proof has been veri ed by the automated proof checker Coq This is part of an ongoing project aiming at the mechanisation of reasoning in extensions of p...
متن کاملReasoning with Executable Specifications
Starting from the speci cation of a small imperative programming language, and the description of two program transformations on this language, we formally prove the correctness of these transformations. The formal speci cations are given in a single format, and can be compiled into both executable tools and collections of de nitions to reason about into a theorem prover. This work is a case st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008